منابع مشابه
Approximations of Modal Logic K
Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This procedure has a clear semantics and a natural proof theory in the context of Massacci’s modal Single Step Tableaux (SST).
متن کاملApproximations of modal logics: K and beyond
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of the n-degree of introspection that is allowed, thus generating modal n-logics. Semantics for n-logics is presented, in which formulas are evaluated with respect to paths, and not possible worlds. A tableau-based proof ...
متن کاملOn Checking Kripke Models for Modal Logic K
This article presents our work toward a rigorous experimental comparison of state-of-the-art solvers for the resolution of the satisfiability of formulae in modal logic K. Our aim is to provide a pragmatic way to verify the answers provided by those solvers. For this purpose, we propose a certificate format and a checker to validate Kripke models for modal logic K. We present some experimental ...
متن کامل1 The System K : A Foundation for Modal Logic
Strictly speaking,modal logic studies reasoning that involves theuseof the expressions ‘necessarily’ and ‘possibly’. The main idea is to introduce the symbols∫ (necessarily) and∂ (possibly) to a system of logic so that it is able todistinguish threedifferentmodesof assertion:∫A(Aisnecessary), A (A is true), and ∂A (A is possible). Introducing these symbols (or operators) would seem to be essent...
متن کاملRelational dual tableau decision procedure for modal logic K
We present a dual tableau system, RLK, which is itself a deterministic decision procedure verifying validity of K-formulas. The system is constructed in the framework of the original methodology of relational proof systems, determined only by axioms and inference rules, without any external techniques. Furthermore, we describe an implementation of the system RLK in Prolog, and we show some of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2006
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2005.04.040